From the Shortest Vector Problem to the Dihedral Hidden Subgroup Problem
نویسنده
چکیده
In Quantum Computation and Lattice Problems [11] Oded Regev presented the first known connection between lattices and quantum computation, in the form of a quantum reduction from the poly(n)-unique shortest vector problem to the dihedral hidden subgroup problem by sampling cosets. This article contains a summary of Regev’s result.
منابع مشابه
Quantum Computation and Lattice Problems
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under the assumption that there exists an algorithm that solves the hidden subgroup problem on the dihedral group by coset sampling. Additionally, we present an approach to solving the hidden subgroup problem on the dihedral...
متن کاملInternship Report – NEC 2008
This report summarizes the work done at NEC Labs America, Princeton from 28th May 2008 to 29th August 2008. I worked under the supervision of Martin Roetteler and collaborated with Hari Krovi. We worked on the hidden subgroup problem(HSP) for dihedral group. Dihedral HSP will solve f(n)-shortest vector lattice problem for f(n) = n 1 2 ([1]), which imply connection with some cryptographic protoc...
متن کاملOptimal measurements for the dihedral hidden subgroup problem
We consider the dihedral hidden subgroup problem as the problem of distinguishing hidden subgroup states. We show that the optimal measurement for solving this problem is the so-called pretty good measurement. We then prove that the success probability of this measurement exhibits a sharp threshold as a function of the density ν = k/ log2N , where k is the number of copies of the hidden subgrou...
متن کاملHow Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?
We study the hardness of the dihedral hidden subgroup problem. It is known that lattice problems reduce to it, and that it reduces to random subset sum with density > 1 and also to quantum sampling subset sum solutions. We examine a decision version of the problem where the question asks whether the hidden subgroup is trivial or order two. The decision problem essentially asks if a given vector...
متن کاملA Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is superpolynomial. We describe a modified algorithm whose running time is still subexponential and whose space requirement is only polynomial.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013